Time-shift attack in practical quantum cryptosystems
نویسندگان
چکیده
منابع مشابه
Time-shift attack in practical quantum cryptosystems
Recently, a new type of attack, which exploits the efficiency mismatch of two single photon detectors (SPD) in a quantum key distribution (QKD) system, has been proposed. In this paper, we propose another “time-shift” attack that exploits the same imperfection. In our attack, Eve shifts the arrival time of either the signal pulse or the synchronization pulse or both between Alice and Bob. In pa...
متن کاملFaked states attack on quantum cryptosystems
A new type of attack on quantum cryptography systems is proposed. In this attack, Eve utilizes various optical imperfections in Bob’s scheme and constructs light pulses so that Bob does not distinguish his detection results from normal, whereas they give Bob the basis and bit value chosen at Eve’s discretion. Applying this attack to systems with passive basis choice on Bob’s side is considered....
متن کاملA Polynomial-Time Key-Recovery Attack on MQQ Cryptosystems
We investigate the security of the family of MQQ public key cryptosystems using multivariate quadratic quasigroups (MQQ). These cryptosystems show especially good performance properties. In particular, the MQQ-SIG signature scheme is the fastest scheme in the ECRYPT benchmarking of cryptographic systems (eBACS). We show that both the signature scheme MQQ-SIG and the encryption scheme MQQ-ENC, a...
متن کاملAttack Cryptosystems Based on HCDLP
We present an algorithm for solving the discrete logarithm problem on hyperelliptic curves defined over finite field when the cyclic group can be represented by special form. On the general case, we design a method to attack on hyperelliptic curve cryptosystems. As an example, we illustrate an attack on the Twin Diffie-Hellman key agreement scheme[5]. As a byproduct, we enumerate the isomorphis...
متن کاملQuantum Algorithms for Boolean Equation Solving and Quantum Algebraic Attack on Cryptosystems
Decision of whether a Boolean equation system has a solution is an NPC problem and finding a solution is NP hard. In this paper, we present a quantum algorithm to decide whether a Boolean equation system F has a solution and compute one if F does have solutions with any given success probability. The complexity of the algorithm is polynomial in the size of F and the condition number of F . As a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Quantum Information and Computation
سال: 2007
ISSN: 1533-7146,1533-7146
DOI: 10.26421/qic7.1-2-3